package leetcode_周赛._2022._202211;

import java.util.*;

/**
 * 第 320 场周赛
 *
 * @author yezh
 * @date 2022/11/20 12:41
 */
public class _20 {

    /**
     * 6243. 到达首都的最少油耗
     */
    public long minimumFuelCost(int[][] roads, int seats) {
        int n = roads.length;
        Map<Integer, List<Integer>> graph = new HashMap<>(n);
        for (int[] road : roads) {
            graph.getOrDefault(road[0], new ArrayList<>()).add(road[1]);
            graph.getOrDefault(road[1], new ArrayList<>()).add(road[0]);
        }
        return 0;
    }

    int dfs(int sn, int fa) {
        int res = 1;
//        for (int )
        TreeSet<Integer> set = new TreeSet<>();
        return 0;
    }

}
